A stochastic Ramsey theorem
نویسندگان
چکیده
منابع مشابه
A stochastic Ramsey theorem
A stochastic extension of Ramsey’s theorem is established. Any Markov chain generates a filtration relative to which one may define a notion of stopping time. A stochastic colouring is any fc-valued (k < oo) colour func tion defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time 6 a...
متن کاملRamsey theorem for designs
We prove that for any choice of parameters k, t, λ the class of all finite ordered designs with parameters k, t, λ is a Ramsey class.
متن کاملA Ramsey theorem for polyadic spaces
A polyadic space is a Hausdorff continuous image of some power of the onepoint compactification of a discrete space. We prove a Ramsey-like property for polyadic spaces which for Boolean spaces can be stated as follows: every uncountable clopen collection contains an uncountable subcollection which is either linked or disjoint. One corollary is that (ακ) is not a universal preimage for uniform ...
متن کاملA Ramsey Theorem for Indecomposable Matchings
A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable matching of one of three types: interleavings, broken nestings, and proper pin sequences.
متن کاملA Ramsey-Type Theorem for Traceable Graphs*
A graph G is traceable if there is a path passing through all the vertices of G. It is proved that every infinite traceable graph either contains arbitrarily large ftnite chordless paths, or contains a subgraph isomorphic to graph A, illustrated in the text. A corollary is that every Jinitely generated infinite lattice of length 3 contains arbitrarily large jkite fences. It is also proved that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2011
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.11.019